Fair Resource Sharing for Stateless-Core Packet-Switched Networks With Prioritization
نویسندگان
چکیده
منابع مشابه
Queue Length Based Fair Queueing in Core-Stateless Networks
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملQueue Length Based Fair Queueing in Core - Stateless Networks 1
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملChannel Sharing Scheme for Packet-Switched Cellular Networks
In this paper, we study an approach for sharing channels to improve network utilization in packet-switched cellular networks. Our scheme exploits unused resources in neighboring cells without the need for global coordination. We formulate a minimax approach to optimizing the allocation of channels in this sharing scheme. We develop a distributed algorithm to achieve this objective and study its...
متن کاملEnhanced core stateless fair queuing with multiple queue priority scheduler
The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple ...
متن کاملMarket-Based Resource Allocation for Packet-Switched Networks
arket forces are the most effective mechanism to fairly and efficiently alloate resources among competing service requests. However, for distributed esources, the implementation of a coherent market mechanism can be comlex and costly. In this paper, we present the design and prototype implemenation of a distributed resource allocation system that allows to apply flowased market mechanisms to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2859783